Extending models of arithmetic

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On extending automorphisms of models of Peano Arithmetic

Continuing the earlier research in [10] we give some information on extending automorphisms of models of PA to end extensions and cofinal extensions.

متن کامل

More on extending automorphisms of models of Peano Arithmetic

Continuing the earlier research [Fund. Math. 129 (1988) and 149 (1996)] we give some information about extending automorphisms of models of PA to cofinal extensions. In recent work on automorphisms of recursively saturated models of PA two themes stand out. One is the classification of conjugacy classes of single automorphisms, the other is the classification of subgroups of the automorphism gr...

متن کامل

Cuts and overspill properties in models of bounded arithmetic

In this paper we are concerned with cuts in models of Samuel Buss' theories of bounded arithmetic, i.e. theories like $S_{2}^i$ and $T_{2}^i$. In correspondence with polynomial induction, we consider a rather new notion of cut that we call p-cut. We also consider small cuts, i.e. cuts that are bounded above by a small element. We study the basic properties of p-cuts and small cuts. In particula...

متن کامل

Canonical Models of Arithmetic

In 1983 Takeuchi showed that up to conjugation there are exactly 4 arithmetic subgroups of PSL2(R) with signature (1;∞). Shinichi Mochizuki gave a purely geometric characterization of the corresponding arithmetic (1;∞)-curves, which also arise naturally in the context of his recent work on inter-universal Teichmüller theory. Using Bely̆ı maps, we explicitly determine the canonical models of thes...

متن کامل

Kripke Models Built from Models of Arithmetic

We introduce three relations between models of Peano Arithmetic (PA), each of which is characterized as an arithmetical accessibility relation. A relation R is said to be an arithmetical accessibility relation if for any modelM of PA,M Prπ(φ) iffM′ φ for allM′ withM RM′, where Prπ(x) is an intensionally correct provability predicate of PA. The existence of arithmetical accessibility relations y...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Mathematical Logic

سال: 1978

ISSN: 0003-4843

DOI: 10.1016/0003-4843(78)90013-x